package com.banmao.algorithm.No101To200.No111;

public class Answer {

    public static void main(String[] args) {
        Solution1 solution = new Solution1();

        TreeNode root = new TreeNode(1, null, new TreeNode(2, new TreeNode(4), new TreeNode(3, new TreeNode(6), new TreeNode(5))));

        int result = solution.minDepth(root);

        System.out.println(result);

    }

}
